Faster Together: Collective Quantum Search
نویسندگان
چکیده
منابع مشابه
Faster Together: Collective Quantum Search
Joining independent quantum searches provides novel collective modes of quantum search (merging) by utilizing the algorithm’s underlying algebraic structure. If n quantum searches, each targeting a single item, join the domains of their classical oracle functions and sum their Hilbert spaces (merging), instead of acting independently (concatenation), then they achieve a reduction of the search ...
متن کاملFaster Database Search for Quantum computing
We propose a new algorithm for quantum database search. Our strategy is to partition the space of all possibilities into subspaces and use a judiciously chosen projection operator as a polarizer in every subspace to filter out the states which have the correct first n-2 qubits. Then we use Grover’s algorithm to determine which one of the four survived states is the oracle. This algorithm has th...
متن کاملA faster database search for quantum computing
We propose a new algorithm for quantum database search. Our strategy is to partition the space of all possibilities into subspaces and use a judiciously chosen projection operator as a polarizer in every subspace to filter out the states which have the correct first n-2 qubits. Then we use Grover’s algorithm to determine which one of the four survived states is the oracle. This algorithm has th...
متن کاملFinding shortest lattice vectors faster using quantum search
By applying a quantum search algorithm to various heuristic and provable sieve algorithms from the literature, we obtain improved asymptotic quantum results for solving the shortest vector problem on lattices. With quantum computers we can provably find a shortest vector in time 21.799n+o(n), improving upon the classical time complexities of 22.465n+o(n) of Pujol and Stehlé and the 22n+o(n) of ...
متن کاملA Faster Lattice Reduction Method Using Quantum Search
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6) and makes use of Grover’s quantum search algorithm. The proposed method has the expected running time O(n(k/6)A+nA). That is about the square root of the running time O(n(k/6)A+nA) of Schnorr’s recent random sampling reduction which in turn improved the running time to the fourt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2015
ISSN: 1099-4300
DOI: 10.3390/e17074838